F-saturation games

نویسندگان

  • Jonathan D. Lee
  • Ago-Erik Riet
چکیده

We study F-saturation games, rst introduced by Füredi, Reimer and Seress [4] in 1991, and named as such by West [5]. The main question is to determine the length of the game whilst avoiding various classes of graph, playing on a large complete graph. We show lower bounds on the length of path-avoiding games, and more precise results for short paths. We show sharp results for the tree avoiding game and the star avoiding game.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal elements of $mathscr{F}_{C,theta}$-majorized mappings and applications to‎ ‎generalized games

In the paper‎, ‎some new existence theorems of maximal elements for‎ ‎$mathscr{F}_{C,theta}$-mappings and $mathscr{F}_{C,theta}$-majorized mappings are established‎. ‎As applications, ‎some new existence theorems of equilibrium points for‎ ‎one-person games‎, ‎qualitative games and generalized games are obtained‎. ‎Our results unify and generalize most known results‎ ‎in recent literature‎.

متن کامل

Graph Saturation Games

We study F-saturation games, first introduced by Füredi, Reimer and Seress [1] in 1991, and named as such by West [2]. A graph G is H-saturated if H is not a subgraph of G, but adding any edge to G causes H to be a subgraph. We can ask what the minimum or maximum number of edges in an H-saturated graph on n vertices is they are known as the saturation number and Turán number (extremal number), ...

متن کامل

Assessment of Children’s Experiences of Playing Computer Games: A Phenomenological Approach

Introduction:  Due to the Attraction and enormous diversity of computer games, children and adolescents allocate a notable part of their time and energy to play these games. This necessitates the study of their Advantages and disadvantages. Therefore, the aim of this study was to represent the outcomes of playing computer games in the fourth grade students. Method: This is a qualitative and phe...

متن کامل

Predicting the Medals of the Countries Participating in the Tokyo 2020 Olympic Games Using the Test of Networks of Multilayer Perceptron (MLP)

Background. International successes, especially in the Olympic Games, have become significantly important to many countries. Hence, the prediction can be better planning to gain this goal. Objectives. This study was conducted to predict the success of the participating countries in the Tokyo Olympic Games and this it was done using smart methods. Methods. This study was conducted in two stage...

متن کامل

Why saturated probability spaces are necessary

An atomless probability space (Ω,A, P ) is said to have the saturation property for a probability measure μ on a product of Polish spaces X×Y if for every random element f of X whose law is margX(μ), there is a random element g of Y such that the law of (f, g) is μ. (Ω,A, P ) is said to be saturated if it has the saturation property for every such μ. We show each of a number of desirable proper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 338  شماره 

صفحات  -

تاریخ انتشار 2015